Boolean functions with a vertex-transitive group of automorphisms

نویسنده

  • Petr Savický
چکیده

A Boolean function is called vertex-transitive, if the partition of the Boolean cube into the preimage of 0 and the preimage of 1 is invariant under a vertex-transitive group of isometric transformations of the Boolean cube. The logarithm of the number of the vertex-transitive functions of n variables is at least Ω(n) and at most O(n logn). There is a polynomial over F2 of any given degree, which defines a vertex-transitive function, and quadratic polynomials with this property can be characterized. There is a vertex-transitive function of n = 4 variables with sensitivity n. Some properties of the groups of the automorphisms of the vertex-transitive functions are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semiregular Automorphisms of Cubic Vertex-transitive Graphs

We characterise connected cubic graphs admitting a vertextransitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph, settling [2, Problem ...

متن کامل

Semiregular Automorphisms of Cubic Vertex-Transitive Graphs and the Abelian Normal Quotient Method

We characterise connected cubic graphs admitting a vertex-transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph. ∗This work was suppo...

متن کامل

Vertex-Transitive Non-Cayley Graphs with Arbitrarily Large Vertex-Stabilizer

A construction is given for an infinite family {0n} of finite vertex-transitive non-Cayley graphs of fixed valency with the property that the order of the vertex-stabilizer in the smallest vertex-transitive group of automorphisms of 0n is a strictly increasing function of n. For each n the graph is 4-valent and arc-transitive, with automorphism group a symmetric group of large prime degree p> 2...

متن کامل

Cubic Non-Cayley Vertex-Transitive Bi-Cayley Graphs over a Regular $p$-Group

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic nonCayley vertex-transitive bi-Cayley graphs over a regular p-group, where p > 5 is a prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order 2p3 is given for each prime p.

متن کامل

Semiregular Automorphisms of Cubic Vertex Transitive Graphs

It is shown that for a connected cubic graph Γ , a vertex transitive group G ≤ AutΓ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2013